Dominating Function in Fractional Graph
نویسندگان
چکیده
Definition of dominating function on a fractional graph G has been introduced. Fractional parameters such as domination number and upper defined. Domination with fuzzy Intuitionistic environment, have found by formulating Linear Programming Problem.
منابع مشابه
On the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملThe k-Dominating Graph
Given a graphG, the k-dominating graph ofG, Dk(G), is defined to be the graph whose vertices correspond to the dominating sets of G that have cardinality at most k. Two vertices in Dk(G) are adjacent if and only if the corresponding dominating sets of G differ by either adding or deleting a single vertex. The graph Dk(G) aids in studying the reconfiguration problem for dominating sets. In parti...
متن کاملthe common minimal dominating signed graph
in this paper, we define the common minimal dominating signed graph of a given signed graph and offer a structural characterization of common minimal dominating signed graphs. in the sequel, we also obtained switching equivalence characterizations: $overline{s} sim cmd(s)$ and $cmd(s) sim n(s)$, where $overline{s}$, $cmd(s)$ and $n(s)$ are complementary signed gra...
متن کاملdominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملMinimum fractional dominating functions and maximum fractional packing functions
The fractional analogues of domination and packing in a graph form an interesting pair of dual linear programs in that the feasible vectors for both LPs have interpretations as functions from the vertices of the graph to the unit interval; efficient (fractional) domination is accomplished when a function simultaneously solves both LPs. We investigate some structural properties of the functions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: ['1742-6588', '1742-6596']
DOI: https://doi.org/10.1088/1742-6596/1947/1/012014